Stochastic computing with biomolecular automata
نویسندگان
چکیده
منابع مشابه
Stochastic computing with biomolecular automata.
Stochastic computing has a broad range of applications, yet electronic computers realize its basic step, stochastic choice between alternative computation paths, in a cumbersome way. Biomolecular computers use a different computational paradigm and hence afford novel designs. We constructed a stochastic molecular automaton in which stochastic choice is realized by means of competition between a...
متن کاملRobust Biomolecular Finite Automata
In this paper we present a uniform method for translating an arbitrary nondeterministic finite automaton (NFA) into a deterministic mass action biochemical reaction network (BRN) that simulates it. The BRN receives its input as a continuous time signal consisting of concentrations of chemical species that vary to represent the NFA’s input string in a natural way. The BRN exploits the inherent p...
متن کاملBiomolecular Computing Systems
The field of biomolecular computation started 3.5 billion years ago on earth when the first life forms evolved. What distinguished these simple organisms from a collection of inanimate molecules was the ability to process information, and it is this ability of chemistry-based computation that powers life in its various forms even today. Our attempts at exploiting this rich molecular tool set fo...
متن کاملBiomolecular computing and programming
Molecular computing is a discipline that aims at harnessing individual molecules at nanoscales for computational purposes. The best studied molecules for this purpose to date have been DNA and bacteriorhodopsin. Molecular computing allows one to realistically entertain, for the rst time in history, the possibility of exploiting the massive parallelism at nanoscales inherent in natural phenomena...
متن کاملComputing Laboratory STOCHASTIC GAMES FOR VERIFICATION OF PROBABILISTIC TIMED AUTOMATA
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic timed automata, forwards reachability is the analysis method of choice, since it can be implemented extremely efficiently. However, for PTAs, such techniques are only able to compute upper bounds on maximum reachability...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2004
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.0400731101